#!/bin/usr/python
#-*- encoding=UTF-8 -*-

"""
: Binary tree ,遍历求深度
: 深度遍历，递归
: 广度遍历
"""

# Definition for a binary tree node.
class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class BTree(object):
    """docstring for BTree"""
    def __init__(self):
        self.root = None

    def is_Empty(self):
        if root is None:
            return True
        else:
            return False


class maxDepth(object):	
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root is None:
        	return 0
        else:
        	return max(self.maxDepth(root.left),self.maxDepth(root.right))+1

if __name__ == '__main__':
	node1 = TreeNode(8)
    print 
